Generators of maximal orders

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal Orders in Semigroups1

Inspired by the ring theory concepts of orders and classical rings of quotients, Fountain and Petrich introduced the notion of a completely 0-simple semigroup of quotients in [19]. This was generalised to a much wider class of semigroups by Gould in [20]. The notion extends the well known concept of group of quotients [8]. To give the definition we first have to explain what is meant by a squar...

متن کامل

On orders of optimal normal basis generators

In this paper we give some experimental results on the multiplicative orders of optimal normal basis generators in F2n over F2 for n < 1200 whenever the complete factorization of 2" 1 is known. Our results show that a subclass of optimal normal basis generators always have high multiplicative orders, at least 0((2" \)/n), and are very often primitive. For a given optimal normal basis generator ...

متن کامل

Distribution Of Maximal Layers Of Random Orders

In this paper we address the problem of computing the expected size of the different maximal layers of a random partial order. That is, given a point set P = {p1, ..., pn} with pi ∈ [0, 1] picked uniformly at random, we try to determine the expected size of successive maximal layers of P . We present an enumerative expression for this quantity when k = 2 and study its behavior for higher dimens...

متن کامل

On Maximal Layers Of Random Orders

ON MAXIMAL LAYERS OF RANDOM ORDERS Indranil Banerjee George Mason University, 2015 Thesis Director: Dr. Dana Richards In this thesis we investigate the maximal layers of random partial orders. Main contributions are two-fold. In the first half we investigate the expected size of different maximal layers of a random partial order. In particular when the points are in a plane, we give an enumerat...

متن کامل

Monoids of IG-type and Maximal Orders

Let G be a finite group that acts on an abelian monoid A. If φ : A → G is a map so that φ(aφ(a)(b)) = φ(a)φ(b), for all a, b ∈ A, then the submonoid S = {(a, φ(a)) | a ∈ A} of the associated semidirect product A⋊G is said to be a monoid of IG-type. If A is a finitely generated free abelian monoid of rank n and G is a subgroup of the symmetric group Sym n of degree n, then these monoids first ap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2015

ISSN: 0021-8693

DOI: 10.1016/j.jalgebra.2014.11.020